Categorical logic of Names and Abstraction in Action Calculi
نویسنده
چکیده
Received Milner's action calculus implements abstraction in monoidal categories, so that familiar-calculi can be subsumed together with the-calculus and the Petri nets. Variables are generalised to names: only a restricted form of substitution is allowed. In the present paper, the well-known categorical semantics of the-calculus is generalised to the action calculus. A suitable functional completeness theorem for symmetric monoidal categories is proved: we determine the conditions under which the abstraction is deenable. Algebraically, the distinction between the variables and the names boils down to the distinction between the transcendental and the algebraic elements. The former lead to polynomial extensions, like e.g. the ring Zx], the latter to algebraic extensions like Z p 2] or Zi]. Building upon the work of P. Gardner, we introduce action categories, and show that they are related to the static action calculus exactly as cartesian closed categories are related to the-calculus. Natural examples of this structure arise from allegories and cartesian bicategories. On the other hand, the free algebras for any commutative Moggi monad form an action category. The general correspondence of action calculi and Moggi monads will be worked out in a sequel to this work.
منابع مشابه
Closed Action Calculi
Action calculi provide a framework for capturing many kinds of interactive behaviour by focussing on the primitive notion of names. We introduce a name-free account of action calculi, called the closed action calculi, and show that there is a strong correspondence between the original presentation and the name-free presentation. We also add free names plus natural axioms to the closed world, an...
متن کاملA generalisation of pre-logical predicates and its applications
This thesis proposes a generalisation of pre-logical predicates to simply typed formal systems and their categorical models. We analyse the three elements involved in pre-logical predicates — syntax, semantics and predicates — within a categorical framework for typed binding syntax and semantics. We then formulate generalised pre-logical predicates and show two distinguishing properties: a) equ...
متن کاملFrom Action Calculi to Linear Logic
Milner introduced action calculi as a framework for investigating models of interactive behaviour. We present a type-theoretic account of action calculi using the propositions-as-types paradigm; the type theory has a sound and complete interpretation in Power’s categorical models. We go on to give a sound translation of our type theory in the (type theory of) intuitionistic linear logic, corres...
متن کاملTowards an Action Re nement
Reenement is the process of deriving speciications on a lower level of abstraction from those on a higher level. A reenement calculus for Abstract State Machines allowing to derive action speciications from another { preserving the semantics of the abstract speciication { will be outlined. Abstract state machines are rephrased as objects with local state. These objects are the structures in whi...
متن کاملFitch-Style Modal Lambda Calculi
Fitch-style modal deduction, in which modalities are eliminated by opening a subordinate proof, and introduced by shutting one, were investigated in the 1990s as a basis for lambda calculi. We show that such calculi have good computational properties for a variety of intuitionistic modal logics. Semantics are given in cartesian closed categories equipped with an adjunction of endofunctors, with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 7 شماره
صفحات -
تاریخ انتشار 1997